One-dimensional approximate point set pattern matching withLp-norm
نویسندگان
چکیده
منابع مشابه
Approximate one-to-one point pattern matching
Given a set A ={a1, . . . ,an} of n image points and a set B ={b1, . . . ,bn} of n model points,the problem is to find a transformation matching (a one-to-one mapping) each point a ∈ A tosome point b ∈ B such that the length of the longest edge in the matching is minimized (so-calledbottleneck distance). The geometric transformations we allow are translation, rot...
متن کاملFast Multi-dimensional Approximate Pattern Matching
We address the problem of approximate string matching in d dimensions, that is, to nd a pattern of size m d in a text of size n d with at most k < m d errors (substitutions, insertions and deletions along any dimension). We use a novel and very exible error model, for which there exists only an algorithm to evaluate the similarity between two elements in two dimensions at O(m 4) time. We extend...
متن کاملOne-Dimensional Vector based Pattern Matching
Template matching is a basic method in image analysis to extract useful information from images. In this paper, we suggest a new method for pattern matching. Our method transform the template image from two dimensional image into one dimensional vector. Also all sub-windows (same size of template) in the reference image will transform into one dimensional vectors. The three similarity measures ...
متن کاملFast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consisting of m points, find the largest match for a subset of the pattern in the data set. This problem is known to be 3-SUM hard and so unlikely to be solvable exactly in subquadratic time. We present an efficient bit-para...
متن کاملEfficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score
In this paper, we study approximate point subset match (APSM) problem with minimum RMSD score under translation, rotation, and one-to-one correspondence in d-dimension. Since this problem seems computationally much harder than the previously studied APSM problems with translation only or distance evaluation only, we focus on speed-up of exhaustive search algorithms that can find all approximate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.11.022